List of numbers – Irrational and suspected irrational numbers γ – ζ(3) – √2 – √3 – √5 – φ – ρ – δS – α – e – π – δ |
|
Binary | 1.001100111011101... |
Decimal | 1.2020569031595942854... |
Hexadecimal | 1.33BA004F00621383... |
Continued fraction | Note that this continuing fraction is not periodic. |
In mathematics, Apéry's constant is a number that occurs in a variety of situations. It arises naturally in a number of physical problems, including in the second- and third-order terms of the electron's gyromagnetic ratio using quantum electrodynamics. It also arises in conjunction with the gamma function when solving certain integrals involving exponential functions in a quotient which appear occasionally in physics, for instance when evaluating the two-dimensional case of the Debye model. It is defined as the number ζ(3),
where ζ is the Riemann zeta function. It has an approximate value of (Wedeniwski 2001)
The reciprocal of this constant is the probability that any three positive integers, chosen at random, will be relatively prime (in the sense that as N goes to infinity, the probability that three positive integers less than N chosen uniformly at random will be relatively prime approaches this value).
Contents |
This value was named for Roger Apéry (1916–1994), who in 1978 proved it to be irrational. This result is known as Apéry's theorem. The original proof is complex and hard to grasp, and shorter proofs have been found later, using Legendre polynomials. It is not known whether Apéry's constant is transcendental.
Work by Wadim Zudilin and Tanguy Rivoal has shown that infinitely many of the numbers ζ(2n+1) must be irrational,[1] and even that at least one of the numbers ζ(5), ζ(7), ζ(9), and ζ(11) must be irrational.[2]
In 1772, Leonhard Euler (Euler 1773) gave the series representation (Srivastava 2000, p. 571 (1.11)):
which was subsequently rediscovered several times.
Ramanujan gives several series, which are notable in that they can provide several digits of accuracy per iteration. These include[3]:
Simon Plouffe has developed other series(Plouffe 1998):
Similar relations for the values of are given in the article zeta constants.
Many additional series representations have been found, including:
and
where
Some of these have been used to calculate Apéry's constant with several million digits.
Broadhurst (1998) gives a series representation that allows arbitrary binary digits to be computed, and thus, for the constant to be obtained in nearly linear time, and logarithmic space.
Apéry's constant can be expressed in terms of the second-order polygamma function as
It can be expressed as the non-periodic continued fraction [1; 4, 1, 18, 1, 1, 1, 4, 1, ...] (sequence A013631 in OEIS).
The number of known digits of Apéry's constant ζ(3) has increased dramatically during the last decades. This is due both to the increase of performance of computers as well as to algorithmic improvements.
Date | Decimal digits | Computation performed by |
---|---|---|
1735 | 16 | Leonhard Euler |
unknown | 16 | Adrien-Marie Legendre |
1887 | 32 | Thomas Joannes Stieltjes |
1996 | 520,000 | Greg J. Fee & Simon Plouffe |
1997 | 1,000,000 | Bruno Haible & Thomas Papanikolaou |
May 1997 | 10,536,006 | Patrick Demichel |
February 1998 | 14,000,074 | Sebastian Wedeniwski |
March 1998 | 32,000,213 | Sebastian Wedeniwski |
July 1998 | 64,000,091 | Sebastian Wedeniwski |
December 1998 | 128,000,026 | Sebastian Wedeniwski (Wedeniwski 2001) |
September 2001 | 200,001,000 | Shigeru Kondo & Xavier Gourdon |
February 2002 | 600,001,000 | Shigeru Kondo & Xavier Gourdon |
February 2003 | 1,000,000,000 | Patrick Demichel & Xavier Gourdon |
April 2006 | 10,000,000,000 | Shigeru Kondo & Steve Pagliarulo (see Gourdon & Sebah (2003)) |
January 2009 | 15,510,000,000 | Alexander J. Yee & Raymond Chan (see Yee & Chan (2009)) |
March 2009 | 31,026,000,000 | Alexander J. Yee & Raymond Chan (see Yee & Chan (2009)) |
September 2010 | 100,000,001,000 | Alexander J. Yee (see Yee) |
This article incorporates material from Apéry's constant on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.